Exponential Families of Non-Isomorphic Triangulations of Complete Graphs
نویسندگان
چکیده
We prove that the number of non-isomorphic face 2-colourable triangulations of the complete graph Kn in an orientable surface is at least 2 n2/54−O(n) for n congruent to 7 or 19 modulo 36, and is at least 2 2/81−O(n) for n congruent to 19 or 55 modulo 108.
منابع مشابه
Recursive constructions for triangulations
Three recursive constructions are presented; two deal with embeddings of complete graphs and one with embeddings of complete tripartite graphs. All three facilitate the construction of 2an 2−o(n2) non-isomorphic face 2-colourable triangulations of Kn and Kn,n,n in orientable and non-orientable surfaces for values of n lying in certain residue classes and for appropriate constants a.
متن کاملA graphical difference between the inverse and regular semigroups
In this paper we investigate the Green graphs for the regular and inverse semigroups by considering the Green classes of them. And by using the properties of these semigroups, we prove that all of the five Green graphs for the inverse semigroups are isomorphic complete graphs, while this doesn't hold for the regular semigroups. In other words, we prove that in a regular se...
متن کاملTesting a Point Null Hypothesis against One-Sided for Non Regular and Exponential Families: The Reconcilability Condition to P-values and Posterior Probability
In this paper, the reconcilability between the P-value and the posterior probability in testing a point null hypothesis against the one-sided hypothesis is considered. Two essential families, non regular and exponential family of distributions, are studied. It was shown in a non regular family of distributions; in some cases, it is possible to find a prior distribution function under which P-va...
متن کاملUncountable families of vertex-transitive graphs of finite degree
Recently the following question was relayed [1] to the second author: What is the cardinality of the set of vertex transitive graphs of finite degree? Our aim in this short note is to show that there are 20 such graphs. Our proof is constructive and is based on ideas of B. Neumann [3]. In order to construct a large such set it is natural to turn to Cayley graphs of finitely generated groups (se...
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 78 شماره
صفحات -
تاریخ انتشار 2000